Evolving Cellular Automata Based Associative Memory for Pattern Recognition
نویسندگان
چکیده
This paper reports a Cellular Automata (CA) model for pattern recognition. The special class of CA, referred to as GMACA (Generalized Multiple Attractor Cellular Automata), is employed to design the CA based associative memory for pattern recognition. The desired GMACA are evolved through the implementation of genetic algorithm (GA). An eÆcient scheme to ensure fast convergence of GA is also reported. Experimental results con rm the fact that the GMACA based pattern recognizer is more powerful than the Hop eld network for memorizing arbitrary patterns.
منابع مشابه
A Cellular System for Pattern Recognition using Associative Neural Networks
A cellular system for pattern recognition is presented in this paper. The cells are placed in a two dimensional array and they are capable of performing basic symbolic processing and exchanging messages about their state. Following a cellular automata like operation the aim of the system is to transform an initial symbolic description of a pattern to a correspondent object level representation....
متن کاملExploring CAState Space to Synthesize Cellular Automata with Specified Attractor Set
The cellular automaton (CA) with multiple attractors in its state space creates immense interest to devise solutions for pattern classification, pattern recognition, design of associative memory, query processing, etc. This work characterizes the CA state space to explore the essential properties of 1-dimensional nonlinear cellular automata with single cycle attractors. The characterization of ...
متن کاملError correcting capability of cellular automata based associative memory
This paper reports the error correcting capability of an associative memory model built around the sparse network of cellular automata (CA). Analytical formulation supported by experimental results has demonstrated the capability of CA based sparse network to memorize unbiased patterns while accommodating noise. The desired CA are evolved with an efficient formulation of simulated annealing (SA...
متن کاملCellular Associative Symbolic Processing for Pattern Recognition
A cellular network of associative processors capable of symbolic processing is described in this paper. The processors are placed in a two dimensional array and they can perform a global set of symbolic rules deening their next state and the messages to be passed to their neighbours. The system follows a cellular automata like operation and the aim is to transform initial symbolic descriptions ...
متن کاملEnergy Efficient Novel Design of Static Random Access Memory Memory Cell in Quantum-dot Cellular Automata Approach
This paper introduces a peculiar approach of designing Static Random Access Memory (SRAM) memory cell in Quantum-dot Cellular Automata (QCA) technique. The proposed design consists of one 3-input MG, one 5-input MG in addition to a (2×1) Multiplexer block utilizing the loop-based approach. The simulation results reveals the excellence of the proposed design. The proposed SRAM cell achieves 16% ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001